Approximating the Permanent
نویسندگان
چکیده
A randomised approximation scheme for the permanent of a 0-1 matrix is presented. The task of estimating a permanent is reduced to that of almost uniformly generating perfect matchings in a graph; the latter is accomplished by simulating a Markov chain whose states are the matchings in the graph. For a wide class of 0-1 matrices the approximation scheme is fully-polynomial, i.e., runs in time polynomial in the size of the matrix and a parameter that controls the accuracy of the output. This class includes all dense matrices (those that contain sufficiently many l’s) and almost all sparse matrices in some reasonable probabilistic model for 0-1 matrices of given density. For the approach sketched above to be computationally efficient, the Markov chain must be rapidly mixing: informally, it must converge in a short time to its stationary distribution. A major portion of the paper is devoted to demonstrating that the matchings chain is rapidly mixing, apparently the first such result for a Markov chain with genuinely complex structure. The techniques used seem to have general applicability, and are applied again in the paper to validate a fully-polynomial randomised approximation scheme for the partition function of an arbitrary monomer-dimer system. Key words, permanent, perfect matchings, counting problems, random generation, Markov chains, rapid mixing, monomer-dimer systems, statistical physics, simulated annealing AMS(MOS) subject classifications. 05C70, 05C80, 60J20, 68Q20 1. Summary. The permanent of an n x n matrix Awith 0-1 entries aij is defined by
منابع مشابه
Approximating the α - permanent
The standard matrix permanent is the solution to a number of combinatorial and graph-theoretic problems, and theα-weighted permanent is the density function for a class of Cox processes called boson processes. The exact computation of the ordinary permanent is known to be #P-complete, and the same appears to be the case for the α-permanent for most values of α. At present, the lack of a satisfa...
متن کاملA simple polynomial time algorithm to approximate the permanent within a simply exponential factor
We present a simple randomized polynomial time algorithm to approximate the mixed discriminant of n positive semidefinite n×n matrices within a factor 2. Consequently, the algorithm allows us to approximate in randomized polynomial time the permanent of a given n×n non-negative matrix within a factor 2. When applied to approximating the permanent, the algorithm turns out to be a simple modifica...
متن کامل4 Approximating the Permanent of a 0 - 1 Matrix
We have some (usually exponentially large) set V of size Z, and we wish to know how many elements are contained in some subset S (which represents elements with some property we are interested in counting). A Monte Carlo method for approximating the size of S is to pick k elements uniformly at random from V and see how many are also contained in S. If q elements are contained in S, then return ...
متن کاملError bounds in approximating n-time differentiable functions of self-adjoint operators in Hilbert spaces via a Taylor's type expansion
On utilizing the spectral representation of selfadjoint operators in Hilbert spaces, some error bounds in approximating $n$-time differentiable functions of selfadjoint operators in Hilbert Spaces via a Taylor's type expansion are given.
متن کاملThe Bethe Permanent of a Non - Negative Matrix ∗ Pascal
It has recently been observed that the permanent of a non-negative matrix, i.e., of a matrix containing only nonnegative real entries, can very well be approximated by solving a certain Bethe free energy minimization problem with the help of the sum-product algorithm. We call the resulting approximation of the permanent the Bethe permanent. In this paper we give reasons why this approach to app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 18 شماره
صفحات -
تاریخ انتشار 1989